Computational geometry - PDFSEARCH.IO - Document Search Engine

Computational geometry
Results: 1031

#	Item
351	CCCG 2011, Toronto ON, August 10–12, 2011 √ Bichromatic Line Segment Intersection Counting in O(n log n) Time Timothy M. Chan∗ Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:16 Segment tree Line segment intersection Point location Sweep line algorithm Delaunay triangulation Computational geometry Differential topology Algebraic topology Fiber bundles Geometry Mathematics Binary trees
352	Flow Complex: General Structure and Algorithm∗ Kevin Buchin† Joachim Giesen‡ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-07-31 13:55:47 Computational geometry Homotopy theory Diagrams Discrete geometry Voronoi diagram Algebraic topology Delaunay triangulation Homotopy Morse theory Mathematics Algebra Topology
353	CCCG 2010, Winnipeg MB, August 9–11, 2010 Finding Monochromatic L-Shapes in Bichromatic Point Sets Farnaz Sheikhi∗ Mark de Berg† Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:20 Coordinate system Trigonometric functions Mathematical analysis Dimensional analysis Computational geometry Geometry Mathematics Analytic geometry
354	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in Rd Zahed Rahmati∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-17 10:55:30 Computational geometry Nearest neighbor graph Nearest neighbor search Connectivity Delaunay triangulation Yao graph Proximity problems Geometry Information science Mathematics
355	CCCG 2009, Vancouver, BC, August 17–19, 2009 Open Problems from CCCG 2008 Erik D. Demaine∗ The following is a list of the problems presented on Add to Reading List Source URL: cccg.ca Language: English - Date: 2009-09-02 14:31:48 Computational geometry Euclidean plane geometry Convex polytope Polygon Simple polygon Star-shaped polygon Convex hull Monotone polygon Geometry Polygons Triangulation
356	16th Canadian Conference on Computational Geometry, 2004 ˝ A remark on the Erdos–Szekeres theorem Adrian Dumitrescu Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-08-23 15:27:23 Discrete geometry Convex analysis Euclidean plane geometry Ramsey theory Convex hull Convex set Polygon Happy Ending problem Convex function Geometry Mathematics Convex geometry
357	Computational Geometry on Optical Multi-Trees (OMULT) Computer System Rabiul Islam, Nahid Afroz, Subir Bandyopadhyay∗ and Bhabani P Sinha† Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-07-31 13:55:48 Computational geometry Convex analysis Convex hull Binary tree Pi Mathematical analysis Mathematics Complex analysis
358	CCCG_xiazhang_revised.dvi Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:15 Triangles Triangle geometry Triangle Computational geometry Euclidean plane geometry Geometry Triangulation Delaunay triangulation
359	http://2011.cccg.ca CCCG will be held in cooperation with the Fields Institute, as part of the Fields Thematic Program on Discrete Geometry and Applications. The conference site will be at Fields and the adjacent campus Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-01-31 13:00:47 Computational geometry Computer graphics Year of birth missing Godfried Toussaint Diane Souvaine
360	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Aggregate-Max Nearest Neighbor Searching in the Plane Haitao Wang∗ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:57 Geometry Search algorithms Computational geometry Diagrams Voronoi diagram Nearest neighbor search Information science Mathematics Discrete geometry

UPDATE